ScaffMatch: scaffolding algorithm based on maximum weight matching
نویسندگان
چکیده
منابع مشابه
ScaffMatch: Scaffolding Algorithm Based on Maximum Weight Matching
MOTIVATION Next-generation high-throughput sequencing has become a state-of-the-art technique in genome assembly. Scaffolding is one of the main stages of the assembly pipeline. During this stage, contigs assembled from the paired-end reads are merged into bigger chains called scaffolds. Because of a high level of statistical noise, chimeric reads, and genome repeats the problem of scaffolding ...
متن کاملSequence analysis ScaffMatch: scaffolding algorithm based on maximum weight matching
Motivation: Next-generation high-throughput sequencing has become a state-of-the-art technique in genome assembly. Scaffolding is one of the main stages of the assembly pipeline. During this stage, contigs assembled from the paired-end reads are merged into bigger chains called scaffolds. Because of a high level of statistical noise, chimeric reads, and genome repeats the problem of scaffolding...
متن کاملParallel Algorithm for Maximum Weight Matching in Trees
Unfortunately, theoretical results from PRAM algorithms do not necessarily match the speedups observed on real parallel machines. In this paper, we present a parallel algorithm that is more practical in that the assumption and cost model used reflect better the reality of commercially available multiprocessors. More precisely, we will use a version of the BSP model [6], referred to as the coars...
متن کاملA scaling algorithm for maximum weight matching in bipartite graphs
Given a weighted bipartite graph, the maximum weight matching (MWM) problem is to find a set of vertex-disjoint edges with maximum weight. We present a new scaling algorithm that runs in O(m √ n logN) time, when the weights are integers within the range of [0, N ]. The result improves the previous bounds of O(Nm √ n) by Gabow and O(m √ n log (nN)) by Gabow and Tarjan over 20 years ago. Our impr...
متن کاملAn O(n^3) time algorithm for the maximum weight b-matching problem on bipartite graphs
A matching between two sets A and B assigns some elements of A to some elements of B. Finding the similarity between two sets of elements by advantage of the matching is widely used in computational biology. Frequently, the capacities of the elements are limited. That is, the number of the elements that can be matched to each element should not exceed a given number. We describe the first O(n) ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bioinformatics
سال: 2015
ISSN: 1367-4803,1460-2059
DOI: 10.1093/bioinformatics/btv211